Homogeneity in Powers of Subspaces of the Real Line
نویسنده
چکیده
Working in ZFC, we prove that for every zero-dimensional subspace S of the real line, the Tychonoff power ωS is homogeneous (ω denotes the nonnegative integers). It then follows as a corollary that ωS is homogeneous whenever S is a separable zero-dimensional metrizable space. The question of homogeneity in powers of this type was first raised by Ben Fitzpatrick, and was subsequently popularized by Gary Gruenhage and Hao-xuan Zhou.
منابع مشابه
Investigation of Two Vector Control Based Methods for Static Synchronous Series Compensator
In this paper, two vector control systems for investigating the performance of Static Synchronous Series Compensators (SSSC) in steady state conditions are presented that are based on famous d-q axis theory. The workability of proposed method to simplify the SSSC mathematical expressions is shown. The performance of SSSC with two different vector controllers, first based on d-q line current...
متن کاملCharacterization of $2times 2$ full diversity space-time codes and inequivalent full rank spaces
In wireless communication systems, space-time codes are applied to encode data when multiple antennas are used in the receiver and transmitter. The concept of diversity is very crucial in designing space-time codes. In this paper, using the equivalent definition of full diversity space-time codes, we first characterize all real and complex $2times 2$ rate one linear dispersion space-...
متن کاملSubspaces of the Sorgenfrey Line
We study three problems which involve the nature of subspaces of the Sorgenfrey Line S. It is shown that no integer power of an uncountable subspace of S can be embedded in a smaller power of S. We review the known results about the existence of uncountable X ⊆ S where X is Lindelöf. These results about Lindelöf powers are quite set-theoretic. A descriptive characterization is given of those su...
متن کاملA Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998